An Upper Bound of Task Loads in a Deadline-D All Busy Period for Multiprocessor Global EDF Real-Time Systems
نویسندگان
چکیده
منابع مشابه
Sensitivity Analysis of Task Period for EDF Scheduled Arbitrary Deadline Real-Time Systems
The correctness of a real-time system depends on not only the system's output but also on the time at which results are produced. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is very useful in an engineering context to know what changes to period (interarrival time) can be made to a task that will deliver a schedulable ...
متن کاملWorst-case utilization bound for EDF scheduling on real-time multiprocessor systems
In this paper we present the utilization bound for Earliest Deadline First (EDF) scheduling on homogeneous multiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively scheduled on each processor according to the EDF algorithm, and allocated according to the First Fit (FF) heuristic, we prove that the worst-case achievable utilization is 0:5(n + 1), where n is the ...
متن کاملMultiprocessor EDF and Deadline Monotonic Schedulability
Schedulability tests are presented for preemptive earliest-deadlinerst and deadline-monotonic scheduling of periodic real-time tasks on a singlequeue m-server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.
متن کاملMultiprocessor EDF and Deadline Monotonic Schedulability Analysis
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue -server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independe...
متن کاملPeriod and Deadline Selection Problem for Real-Time Systems
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems, as they permit performance guarantee. Existing frameworks assume that only task periods are adjustable parameters and that task deadlines remain unchanged at all times. This paper formally introduces a more general real-time task model where task deadlines, which are less than or equal to task...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Systems Science and Engineering
سال: 2019
ISSN: 0267-6192
DOI: 10.32604/csse.2019.34.171